\section{Conclusion}
We present a one-pass 5.24-approximation algorithm for the maximum
matching problem on the semi-streaming model. Over several papers considering
maximum matchings on streams, the improvement in the approximation guarantee has been marginal, starting with 6 and now at 5.24.
%Even our algorithm and analysis do not break away from this. 
While we believe that our algorithm and analysis have the potential to be extended further, 
the most interesting question is to better understand the barrier with these approaches. Is there any reason why an approximation guarantee closer to 2 seems difficult to attain? Are there lower bounds or are there superior techniques that have eluded us?
%
% Our algorithm and analysis has the potential to be extended further.
%
%The main open problem is to improve the approximation factor from
%5.24 and also simplify the proof.
